Some groups in logic

Some Logic in Communication

Sentences containing pronouns or indefinite noun phrases can be said to express open propositions, propositions which display gaps to be filled. This paper addresses the question what kind of information of a speaker can be said to support the utterance of such propositions. We consider a set of cases exemplifying proper and improper uses of these terms, and we argue that neither the classical ...

Pairwise‎ ‎non-commuting elements in finite metacyclic $2$-groups and some finite $p$-groups

Let $G$ be a finite group‎. ‎A subset $X$ of $G$ is a set of pairwise non-commuting elements‎ ‎if any two distinct elements of $X$ do not commute‎. ‎In this paper‎ ‎we determine the maximum size of these subsets in any finite‎ ‎non-abelian metacyclic $2$-group and in any finite non-abelian $p$-group with an abelian maximal subgroup‎.

Some geodesic problems in groups

We consider several algorithmic problems concerning geodesics in finitely generated groups. We show that the three geodesic problems considered by Miasnikov et al [8] are polynomial-time reducible to each other. We study two new geodesic problems which arise in a previous paper of the authors and Fusy [5].

Some Computationalconstraints In Epistemic Logic

Some Holomorphic Semi-groups.

W ∗ k = {x ǫX|xǫ Domain (A(a1) . . .A (ak)) for all a1, . . . , akǫA} is dense inX in theweak* topology. Let {e1, . . . , en} be a basis forA and setAi = A(ei), A ∗ i = A(ei). If α = (α1, . . . , αk), 1 ≤ αi ≤ n, is a sequence of integers we denote a product such as Aα1 . . .Aαk byAα; |α| = k is the length ofα. The operatorB ◦ = Σ|α|≤maαAα (the coefficients are complex numbers) is defined on Wm...